Unconstrained Diameters for Deep Coalescence
نویسندگان
چکیده
منابع مشابه
Non-hereditary Minimum Deep Coalescence trees
— One of the goals of phylogenetic research is to find the species tree describing the evolutionary history of a set of species. But the trees derived from geneti data with the help of tree inference methods are gene trees that need not coincide with the species tree. This can for example happen when so-called deep coalescence events take place. It is also known that species trees can differ fr...
متن کاملDeep Structured Output Learning for Unconstrained Text Recognition
We develop a representation suitable for the unconstrained recognition of words in natural images, where unconstrained means that there is no fixed lexicon and words have unknown length. To this end we propose a convolutional neural network (CNN) based architecture which incorporates a Conditional Random Field (CRF) graphical model, taking the whole word image as a single input. The unaries of ...
متن کاملUnconstrained OCR for Urdu using Deep CNN-RNN Hybrid Networks
Building robust text recognition systems for languages with cursive scripts like Urdu has always been challenging. Intricacies of the script and the absence of ample annotated data further act as adversaries to this task. We demonstrate the effectiveness of an end-to-end trainable hybrid CNN-RNN architecture in recognizing Urdu text from printed documents, typically known as Urdu OCR. The solut...
متن کاملDeep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms
Gene tree reconciliation problems invoke the minimum number of evolutionary events that reconcile gene evolution within the context of a species tree. Here we focus on the deep coalescence (DC) problem, that is, given an unrooted gene tree and a rooted species tree, find a rooting of the gene tree that minimizes the number of DC events, or DC cost, when reconciling the gene tree with the specie...
متن کاملMean deep coalescence cost under exchangeable probability distributions
We derive formulas for mean deep coalescence cost, for either a fixed species tree or a fixed gene tree, under probability distributions that satisfy the exchangeability property. We then apply the formulas to study mean deep coalescence cost under two commonly used exchangeable models—the uniform and Yule models. We find that mean deep coalescence cost, for either a fixed species tree or a fix...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Computational Biology and Bioinformatics
سال: 2017
ISSN: 1545-5963,1557-9964,2374-0043
DOI: 10.1109/tcbb.2016.2520937